Nonnegative Polynomial with no Certificate of Nonnegativity in the Simplicial Bernstein Basis

نویسنده

  • Christoffer Sloth
چکیده

This paper presents a nonnegative polynomial that cannot be represented with nonnegative coefficients in the simplicial Bernstein basis by subdividing the standard simplex. The example shows that Bernstein Theorem cannot be extended to certificates of nonnegativity for polynomials with zeros at isolated points.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials

Various key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove complexity bounds for these types of problems are based on sums of squares (SOS) as nonnegativity certificates. In this article, we initiate the analysis of optimization problems over the boolean hypercube via a recent, ...

متن کامل

Numerical resolution of large deflections in cantilever beams by Bernstein spectral method and a convolution quadrature.

The mathematical modeling of the large deflections for the cantilever beams leads to a nonlinear differential equation with the mixed boundary conditions. Different numerical methods have been implemented by various authors for such problems. In this paper, two novel numerical techniques are investigated for the numerical simulation of the problem. The first is based on a spectral method utiliz...

متن کامل

Certificates for Nonnegativity of Polynomials with Zeros on Compact Semialgebraic Sets

We prove a criterion for an element of a commutative ring A to be contained in an archimedean semiring T ⊂ A. It can be used to investigate the question whether nonnegativity of a polynomial on a compact semialgebraic set can be certified in a certain way. In case of (strict) positivity instead of nonnegativity, our criterion simplifies to classical results of Stone, Kadison, Krivine, Handelman...

متن کامل

On the optimal stability of the Bernstein basis

We show that the Bernstein polynomial basis on a given interval is “optimally stable,” in the sense that no other nonnegative basis yields systematically smaller condition numbers for the values or roots of arbitrary polynomials on that interval. This result follows from a partial ordering of the set of all nonnegative bases that is induced by nonnegative basis transformations. We further show,...

متن کامل

Fast determination of the tensorial and simplicial Bernstein forms of multivariate polynomials and rational functions

Tests for speeding up the determination of the Bernstein enclosure of the range of a multivariate polynomial and a rational function over a box and a simplex are presented. In the polynomial case, this enclosure is the interval spanned by the minimum and the maximum of the Bernstein coe cients which are the coe cients of the polynomial with respect to the tensorial or simplicial Bernstein basis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1710.05735  شماره 

صفحات  -

تاریخ انتشار 2017